On Generalized Multiple-instance Learning

نویسندگان

  • Stephen Scott
  • Jun Zhang
  • Joshua Brown
چکیده

We describe a generalization of the multiple-instance learning model in which a bag’s label is not based on a single instance’s proximity to a single target point. Rather, a bag is positive if and only if it contains a collection of instances, each near one of a set of target points. We list potential applications of this model (robot vision, content-based image retrieval, protein sequence identification, and drug discovery) and describe target concepts for these applications that cannot be represented in the conventional multiple-instance learning model. We then adapt a learning-theoretic algorithm for learning in this model and present empirical results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Different Learning Levels in Multiple-choice and Essay Tests: Immediate and Delayed Retention

    This study investigated the effects of different learning levels, including Remember an Instance (RI), Remember a Generality (RG), and Use a Generality (UG) in multiple-choice and essay tests on immediate and delayed retention. Three-hundred pre-intermediate students participated in the study. Reading passages with multiple-choice and essay questions in different levels of learning were giv...

متن کامل

MICCLLR: A Generalized Multiple-Instance Learning Algorithm Using Class Conditional Log Likelihood Ratio

We propose a new generalized multiple-instance learning (MIL) algorithm, MICCLLR (multiple-instance class conditional likelihood ratio), that converts the MI data into a single meta-instance data allowing any propositional classifier to be applied. Experimental results on a wide range of MI data sets show that MICCLLR is competitive with some of the best performing MIL algorithms reported in li...

متن کامل

A Faster Algorithm for Generalized Multiple-Instance Learning Qingping Tao

In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag’s label is not based on a single instance’s proximity to a single target point. Rather, a bag is positive if and only if it contains a collection of instances, each near one of a set of target points. This generalized model is much more expressive than the conventional multipleinstance...

متن کامل

A Faster Algorithm for Generalized Multiple-Instance Learning

In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag’s label is not based on a single instance’s proximity to a single target point. Rather, a bag is positive if and only if it contains a collection of instances, each near one of a set of target points. This generalized model is much more expressive than the conventional multipleinstance...

متن کامل

Entropy and Margin Maximization for Structured Output Learning

We consider the problem of training discriminative structured output predictors, such as conditional random fields (CRFs) and structured support vector machines (SSVMs). A generalized loss function is introduced, which jointly maximizes the entropy and the margin of the solution. The CRF and SSVM emerge as special cases of our framework. The probabilistic interpretation of large margin methods ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • International Journal of Computational Intelligence and Applications

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2005